Experimental Evaluation of Fast Solution Algorithms for the Simple Motif Problem
نویسندگان
چکیده
The Simple Motif Problem (SMP) is: given a set of strings Y = {y0, y1, . . . , yn−1} built from a finite alphabet Σ, p > 0 an integer and q ≤ n a quorum, find all the simple motifs of length at most p that occurs in at least q strings of Y . This paper presents an experimental evaluation of algorithms dealing with SMP and using a minimal forbidden pattern approach. The experiments are concerned both with running times and space consumption.
منابع مشابه
A fast and simple method for modeling of oil swelling in Co2 injection
In this paper, the role of molecular diffusion in mobilization of waterflood residual oil is examined. A moving mesh method is applied to solve the moving interface problem of residual oil blobs swelling by Co2 diffusion through a blocking water phase. The results of this modeling are compared with experimental results of a 2D glass micromodel experiment. Although, the solution method is applie...
متن کاملImproving the RX Anomaly Detection Algorithm for Hyperspectral Images using FFT
Anomaly Detection (AD) has recently become an important application of target detection in hyperspectral images. The Reed-Xialoi (RX) is the most widely used AD algorithm that suffers from “small sample size” problem. The best solution for this problem is to use Dimensionality Reduction (DR) techniques as a pre-processing step for RX detector. Using this method not only improves the detection p...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملAn Improved DPSO Algorithm for Cell Formation Problem
Cellular manufacturing system, an application of group technology, has been considered as an effective method to obtain productivity in a factory. For design of manufacturing cells, several mathematical models and various algorithms have been proposed in literature. In the present research, we propose an improved version of discrete particle swarm optimization (PSO) to solve manufacturing cell ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011